Method and apparatus for resetting a gray code counter

ABSTRACT

Aspects of the invention may include gradually decrementing or incrementing a write pointer ( 370 ) associated with a data buffer such as the FIFO buffer ( 310 ) until a reset value of the write pointer ( 370 ) is reached in response to an indication that a data buffer controlled by the gray code counter is empty. Additionally, a read pointer ( 380 ) associated with the data buffer ( 310 ) may be gradually incremented or decremented until a reset value of the read pointer ( 380 ) is reached in response to an indication that the data buffer controlled by the gray code counter is full. The data buffer may be a first-in-first-out (FIFO) buffer such as FIFO buffer  310 , which may be asynchronously clocked. The data buffer may be adapted to buffer any one or a combination of video, voice and data.

[0001] This application makes reference to, claims priority to and claims the benefit of U.S. Provisional Patent Application Serial No. 60/361,163 filed on Mar. 1, 2002.

[0002] The above stated application is incorporated herein by reference in its entirety.

BACKGROUND OF THE INVENTION

[0003] Certain embodiments of the present invention relate to processing of buffered digital signals. More specifically, certain embodiments relate to a method and apparatus for resetting a gray code counter associated with a video, voice and/or data buffer.

[0004] A gray code is a binary code in which consecutive decimal numbers are represented by a binary expression that differ in the state of one (1), and only one (1) bit. Accordingly, a gray code counter is a counter in which each successive binary count differs by one bit.

[0005]FIG. 1 is an exemplary finite state machine (FSM) 100 that may be used to implement a gray code counter. Referring to FIG. 1, the finite state machine 100, for example, may be used to implement a 4-bit counter, which may range from zero (0) to fifteen (15). Initial state 102 may represent binary state 0000 and a final state 110 may represent binary state 1000. Each consecutive state between initial binary state 102 and final state 110 vary by only one (1) bit. For example in state 104, a consecutive state to the initial state 102, only the least significant bit, bit four (4) changes. Similarly, in state 106, a consecutive state to the state 104, only the bit next to the least significant bit, bit three (3), changes. Similar single bit changes occur until the final binary state 110 is reached. At this point, a reset or a rollover occurs to the initial state 102, in which the binary values of the gray code counter changes from 1000 to 0000.

[0006] In certain applications, it might be advantageous to switch a single bit in any clock instant. For example, in integrated circuits (ICs), which may be prone to noise or which require a low noise environment for optimal operation or performance, gray code counters may be preferable over binary counters, the latter of which switches more than one bit at any clock instant. In general, the greater the number of bits being switched, the greater the amount of noise generated since each bit transition generates noise. Similarly, the lesser the number of bits number being switched, the lesser the amount of generated noise since there are less transitions to generate noise.

[0007] In general, gray code counters may be sampled asynchronously at any time during a given clock period. In this regard, since only one bit changes during any given transition, a maximum sampling error for a gray code counter is one (1). With binary counters, however, errors may occur with asynchronous sampling since some flip-flops (FF) used to implement the binary counter may have transitioned prior to or subsequent to a sampling instant. In this case, if the sampling instant occurs at or near a rising edge or a falling edge of a clock, then some FFs may have transitioned before others, thereby causing the errors.

[0008] Gray code counters may be particularly useful in applications that include, but are not limited to, asynchronous video, voice and data communication. In this regard, a gray code counter may be utilized for accessing certain video, voice and/or data buffers. In such applications, particularly with video applications, impairments such as noise and/or transients may cause errors in the gray code counter. In particular, since asynchronous clock signals may be used to control the buffers, a reset of the gray code counter may cause a non-gray code transition, which may result in glitching. In this case, the buffer may enter an undesired state, thereby causing a buffer status error.

[0009] Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such systems with some aspects of the present invention as set forth in the remainder of the present application with reference to the drawings.

BRIEF SUMMARY OF THE INVENTION

[0010] Certain embodiments of the invention afford an approach to reset a gray code counter without generating flags that falsely indicate a state of a data buffer. A method for resetting a gray code counter may include, gradually decrementing or incrementing a write pointer associated with the data buffer until a reset value of the write pointer is reached in response to an indication that a data buffer controlled by the gray code counter has attained one of a plurality specified states. Additionally, a read pointer associated with the data buffer may be gradually incremented or decremented until a reset value of the read pointer is reached in response to an indication that the data buffer controlled by the gray code counter has attained one of the plurality of specified states. The specified states may include full, empty and one or more predefined states indicating various levels between empty and full. The data buffer may be a first-in-first-out (FIFO) buffer, which may be asynchronously clocked. The data buffer may be adapted to buffer video, voice and/or data.

[0011] In another embodiment of the invention, a method for resetting a gray code counter is provided. The method may include disabling any attempt to write to the data buffer until a reset value of a write pointer controlling the data buffer is reached in response to an indication that a data buffer controlled by the gray code counter has attained one of a plurality specified states. Additionally, any attempt to read from the data buffer until a reset value of a read pointer controlling the data buffer is reached may be disabled in response to an indication that the data buffer controlled by the gray code counter has attained the one of a plurality specified states. The specified states may include full, empty and one or more predefined states indicating various levels between empty and full. Disabling any attempt to write to the data buffer may further include disabling generation of at least one flag until the reset value of the write pointer controlling the data buffer is reached. Similarly, disabling any attempt to read from the data buffer may further include disabling generation of at least one flag until the reset value of the read pointer controlling the data buffer is reached. The data buffer may be a first-in-first-out (FIFO) buffer, which may be asynchronously clocked. The data buffer may be adapted to buffer at video, voice and/or data.

[0012] Another aspect of the invention may include, a machine-readable storage, having stored thereon a computer program having at least one code section executable by a machine for causing the machine to perform the above-mentioned steps in accordance with the various embodiments disclosed.

[0013] Another aspect of the invention also provides a system for resetting a gray code counter. The system may include at least one decrementer for gradually decrementing a write pointer associated with the data buffer until a reset value of the write pointer is reached in response to an indication that a data buffer controlled by the gray code counter has attained one of a plurality specified states. At least one incrementer may be provided for gradually incrementing a read pointer or a write pointer associated with the data buffer until a reset value of the read pointer is reached in response to an indication that the data buffer controlled by the gray code counter has attained one of the plurality of specified states. At least one decrementer may be provided for gradually decrementing a read pointer or a write pointer associated with the data buffer until a reset value of the read pointer is reached in response to an indication that the data buffer controlled by the gray code counter has attained one of the plurality of specified states. The specified states may include full, empty and one or more predefined states indicating various levels between empty and full. A flag generator may be provided for comparing an output of a write gray code counter associated with the write pointer and an output of a read gray code counter associated with the read pointer.

[0014] These and other advantages, aspects and novel features of the present invention, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings.

BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS

[0015]FIG. 1 is an exemplary finite state machine that may be used to implement a gray code counter.

[0016]FIG. 2 is a block diagram of an exemplary system that utilizes a video FIFO in accordance with an embodiment of the present invention.

[0017]FIG. 3 is a block diagram of an exemplary asynchronous FIFO system including apparatus for resetting gray code counters associated with, for example, a video FIFO, in accordance with an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[0018] Aspects of the invention provide a method and system for resetting gray code counters associated with a FIFO video, voice and/or data buffer. In response to an indication that a data buffer controlled by the gray code counter is empty, a write pointer associated with a data buffer such as the FIFO buffer may be gradually decremented or incremented until a reset value of the write pointer is reached. Additionally, in response to an indication that the data buffer controlled by the gray code counter has reached a particular state, a read pointer associated with the data buffer may be gradually incremented or decremented until a reset value of the read pointer is reached. The state may be full, empty or any state defined between empty and full. The data buffer may be an asynchronously clocked a first-in-first-out (FIFO) buffer. The data buffer may be adapted to buffer any one or a combination of video, voice and data.

[0019]FIG. 2 is a block diagram of an exemplary system that utilizes a video FIFO in accordance with an embodiment of the present invention. Referring to FIG. 2, block diagram 200 may include a DRAM controller 202, a DRAM 204, a bus 206, a graphics engine (GE) window controller 210, graphics (GFx) first-in-first-out (FIFO) buffers 212 a, 212 b, 212 c, graphics converters 214 a, 214 b, 214 c, and color look-up tables (CLUTs) 216 a, 216 b, 216 c. FIG. 2 may also include a graphics layer sorter 218, a graphics blender 220, a filter block 222 and a display FIFO buffer block 224. Although block diagram 200 may include DRAM controller 202 and DRAM 204, the invention is not limited in this regard. Accordingly, any suitable memory or video random access memory (VRAM), controlled by a suitable memory controller or processor may be utilized. The CLUTs 216 a, 216 b, 216 c may be formatted as a data structure and stored in a memory 226 and/or DRAM 104. Memory 226 may be an SRAM, although the invention is not so limited.

[0020] DRAM controller 202 and DRAM 204 may be coupled to bus 206 in any suitable manner such as is conventionally known. Alternatively, the graphics layer sorter may be coupled to the DRAM controller 202 instead of the bus 206. GE window controller 210 may be coupled to bus 206. The GE window controller 210 may be adapted to control a plurality of graphics FIFO buffers 212 a, 212 b, 212 c. In this regard, various outputs of the GE window controller 210 may be coupled to an input of each of the graphics FIFOs 212 a, 212 b, 212 c. The output of each of the graphic FIFOs 212 a, 212 b, 212 c may be coupled to an input of a corresponding graphics converter 214 a, 214 b, 214 c. Each graphics converter 214 a, 214 b, 214 c may be adapted to be associated with a corresponding CLUT 216 a, 216 b, 216 c. In this arrangement, there may be a one-to-one association between a graphics FIFO, its corresponding graphics converter and its corresponding CLUT. For example, an output of graphics FIFO 212 a may be coupled to an input of graphics converter 214 a, which may have an associated corresponding CLUT 216 a. An output of graphics FIFO 212 b may be coupled to an input of graphics converter 214 b, which may have an associated corresponding CLUT 216 b. An output of graphics FIFO 212 c may be coupled to an input of graphics converter 214 c, which may have an associated corresponding CLUT 216 c.

[0021] An output of each of the graphics converters 214 a, 214 b, 214 c may be coupled to one or more inputs of graphics layer sorter 218. Graphics blender 220 may be adapted to receive an output of the graphics layer sorter 218. An output of the graphics blender 220 may be coupled to a filter block 222, which may include at least one filter element. The output of the filter block 222 may be coupled to an input of display FIFO block 224. The display FIFO block 224 may include one or more display FIFO buffers. Finally, an output of the display FIFO 224 may be coupled to a video-processing element such as a video processor (not shown).

[0022] DRAM 204 may be adapted to stored graphics image data. The DRAM controller 202 may be configured to control the transfer of graphics image data to and from the DRAM 204 via, for example, bus 206. In one embodiment of the invention, DRAM controller 202 may be used to control the transfer of graphics image data from the DRAM 204 to the GE window controller 210. The GE window controller 210 may be adapted to control a manner in which graphics images may be displayed over the complete viewing portion of a video display terminal. GE window controller 210 may be adapted to control display attributes for the viewable portion of the video display terminal such as the display height, display width, aspect ratio and any special formatting. The GE window controller 210 may be adapted to control a manner in which each line of the viewing portion of the video display terminal may be displayed. GE window controller 210 may be adapted to control line attributes for each line to be displayed on the video display terminal. These attributes may include, but are not limited to, the start of a line, the end of a line and any special formatting that the line may possess. Each of the graphics FIFO buffers 212 a, 212 b, 212 c may be adapted to store graphics image data for a particular line to be display on the video display terminal.

[0023] Each of the corresponding graphics converters 214 a, 214 b, 214 c may be adapted to interpret graphics image data received from the connected graphics FIFO. Based on the received graphics image data, each of the graphics converters 214 a, 214 b, 214 c may consult their associated corresponding CLUT 216 a, 216 b, 216 c respectively, to acquire color information pertaining to a particular pixel for a line to be displayed. For example, based on the graphics image data for a particular line received from graphics FIFO 212 a, graphics converter 214 a may consult its associated corresponding CLUT 216 a to acquire color information pertaining to a particular pixel for the line to be displayed. Based on the graphics image data for a particular line received from graphics FIFO 212 b, graphics converter 214 b may consult its associated corresponding CLUT 216 b to acquire color information pertaining to a particular pixel for the line to be displayed. Finally, based on the graphics image data for a particular line received from graphics FIFO 212 c, graphics converter 214 c may consult its associated corresponding CLUT 216a to acquire color information pertaining to a particular pixel for the line to be displayed.

[0024] Graphics layer sorter 218 may be adapted to receive processed output graphics image data from the graphics converters 214 a, 214 b, 214 c and may accordingly sort various portions of the graphic image for overlay based on the data received from the graphic converters 214 a, 214 b, 1154 c. In this regard, graphics layer sorter 218 may be adapted to add spatial depth to the processed image data. Graphics blender 220 may receive a sorted layer output from the graphics layer sorter 218 and accordingly merge or overlay the various layers of the graphics image.

[0025] Filter block 222 may include one or more post-processing filters that may be adapted to filter out any unwanted or undesirable effects. For example, filter block 222 may include a post-processing filter that may be adapted to filter out any unwanted high frequency distortion that may distort at least a portion of an output graphic image. The output of the filter block 222 may be buffered in display FIFO 224 before being transferred to a video processor or engine for processing. The video processor or engine may, for example, encode the graphics display data received from the display FIFO 224 in a format suitable for display on the video display terminal. In this regard, the video processor or engine may encode the graphics display in a format such as national television system committee (NTSC), phase alternate line (PAL) and sequential color and memory (SECAM).

[0026]FIG. 3 is a block diagram of an exemplary asynchronous FIFO system 300 including apparatus for resetting gray code counters associated with, for example, a video FIFO, in accordance with an embodiment of the present invention. FIG. 3 may include a FIFO buffer 310, a flag generator block 320, a first gray code counter 350, a second gray code counter 360, a write pointer 370, and a read pointer 380. FIG. 3 may also include a write clock (wr_clk) signal 397, a read clock (rd_clk) signal 399, a write reset wr_rst signal 390 and a read reset (rd_rst) signal 395. The first gray code counter 350, the write pointer 370, the write clock wr_clk signal 397, and the write reset wr_rst signal 390 may be collectively referred as the write side. The second gray code counter 360, the read pointer 380 the read clock rd_clk signal 399, and the read reset rd_rst signal 395 may be collectively referred to as the read side.

[0027] The FIFO buffer 310 may preferably be an asynchronous FIFO buffer. The read pointer 380 and the write pointer 370 may be registers or memory locations that may be used to store the address or offset to a specified memory location. Flag generator block 320 may include a comparator and other suitable logic circuit that may have the capability to compare the outputs of gray code counters 350, 360. The write clock signal wr_clk 397 may be adapted as an input to the asynchronous FIFO buffer 310 and the write pointer 370. A write-reset wr_rst signal 390 may be coupled as an input to the write pointer 370.

[0028] The output of write pointer 370 may be coupled to an input of the gray code counter 350. An output of the gray code counter 350 may be coupled to an input of the flag generator block 320 and an input of the FIFO buffer 310. The read clock signal rd_clk 399 may be adapted as an input to the asynchronous FIFO buffer 310 and the read pointer 380. A read-reset rd_rst signal 395 may be coupled as an input to the read pointer 370. The output of read pointer 380 may be coupled to an input of the second gray code counter 360. An output of the second gray code counter 360 may be coupled an input of FIFO buffer 310 and also to the flag generator block 320.

[0029] In an embodiment of the invention, the asynchronous FIFO system 300 may be adapted to handle digital video information in the form of video lines received from, for example, the graphics engine window controller 210 (FIG. 2). In this regard, a line of video data may be clocked into or written into the FIFO buffer 310 and may be clocked out or read out of the FIFO buffer 310 to a memory such as SRAM 226. The graphics FIFOs 212 a, 212 b and 212 c (FIG. 2) may be representative of the FIFO system 300. Writing to the FIFO system 300 and reading from the FIFO system 300 may be achieved in a synchronous manner utilizing two different clock signals, namely wr_clk 397 and rd_clk 399, respectively. Notably, it may be necessary to track various states of the FIFO system 300 in order to ensure that video data does not get inadvertently written to the FIFO system 300 and/or read out of the FIFO system 300 incorrectly.

[0030] During operation of the FIFO system 300, the write pointer 370 may be incremented or decremented by the write clock signal 397. The output of the write pointer 370 may be a binary number. This binary number may be converted to a gray code output by gray code counter 350. The gray code output may be a digitally represented output, in which consecutive outputs differ by only one bit change whenever the gray code counters 350, 360 gets incremented or decremented by one (1). The output of gray code counters 350, 360 may be communicated to an input of flag generator block 320. In one aspect of the invention, the output of gray code counter 350 may be converted back to normal binary representation and may be sent to FIFO buffer 310 where it may be used to indicate the next FIFO location that is to be written.

[0031] During reading of the FIFO buffer 310, the read pointer 380 may be decremented or incremented by the read clock rd_clk signal 399. The output of the read pointer 380 may be a binary number. This binary number may be converted to a gray code output by gray code counter 360. The gray code output may be a digitally represented output, in which consecutive outputs differ by only one bit change whenever the gray code counter 360 gets incremented or decremented by one (1). The output of gray code counter 360 may be communicated to an input of flag generator block 320. The output of gray code counter 360 may also be converted back to normal binary representation and may be sent to FIFO buffer 310 where it may be used to indicate the next FIFO location that is to be read.

[0032] The output of gray code counter 350 may indicate a number of FIFO positions that may have to be written for a current video line. The output of gray code counter 360 may be configured to indicate the number of FIFO positions have been read out for the current video line. When the end of a video line being written to the FIFO buffer 310 or read out of the FIFO buffer 310 has been reached, the corresponding write pointer 370 and read pointer 380 may be reset to their original starting values.

[0033] The flag generator block 320 may be configured to compare the output of the two gray code counters and generate various flag outputs based on the comparison. For example, a flag indicating that the FIFO buffer 310 is full may be generated to indicate when the read side of the FIFO buffer 310 is ready to be read out. Similarly, a flag indicating that the FIFO buffer 310 is empty may be generated to indicate when the write side of the FIFO buffer is ready to be written to. Not withstanding, when the write pointer 370 or the read pointer 380 reaches the end of a video line and has to be reset or rolled over, the logic in the flag generator block 320 may cause a non-gray code transition at the output of the gray code counters 350, 360. This non-gray code transition may be the result of the flag generator block 320 failing to determine and track when the read pointer 380 and/or the write pointer 370 gets reset or rolled over.

[0034] Whenever this occurs, the flag generator block 320 may assert a false flag. For example, upon reset of the read pointer 380, a false flag may get generated indicating that the FIFO buffer 310 may be at half its capacity even though it may actually be empty. This may result in the read side of the FIFO buffer 310 attempting to continue to read out certain positions of the FIFO buffer 310 even though those positions have not been re-written with the next line of video data.

[0035] In an embodiment of the invention, the problem associated with the generation of false flags may be solved by gradually incrementing or decrementing the gray code counters upon reset of the read pointer 380 and/or the write pointer 370. On the write side, when a current line of video data has been completely written or the end of current video line is reached, instead of immediately resetting the write pointer 370 to its original starting state, the write pointer may be gradually decremented or incremented until it reaches its starting state. As a result, logic and/or suitable logic in the flag generator block 320 may respond appropriately and no flags may be generated that may indicate an incorrect state of the FIFO buffer 310. Similarly, on the read side, when a current line of video data has been completely read out of the buffer or end of the video line has been reached, instead of immediately resetting the read pointer 380 to its original starting state, the read pointer may be gradually incremented or decremented until it reaches its starting or initial state. Again, no flags may be generated that may indicate an incorrect state of the FIFO buffer 310.

[0036] In a second embodiment of the invention, the flag generator block 320 may be gated or otherwise configured so that no incorrect flags are generated during a reset or roll over time interval for the gray code counters 350, 360. Accordingly, flags generated during the reset time interval may be ignored. In this case, read and write operations to the FIFO buffer 310 may be disabled and any attempt to write to or read from the FIFO buffer 310 may be barred to prevent the generation of flags. In summary, certain embodiments of the present invention afford an approach to reset a gray code counter without generating flags that falsely indicate a state of a FIFO buffer.

[0037] In accordance with the various aspects of the invention, it should be recognized that the various states illustrated may be changed or otherwise altered without departing from the spirit and attributes of the invention. Additionally, varying states may be defined between full and empty, which conforms to the scope of the invention.

[0038] The present invention may be realized in hardware, software, or a combination of hardware and software. In this regard, the present invention may be realized in a centralized fashion in one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general-purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.

[0039] The present invention also may be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.

[0040] While the present invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope or essential attributes of the present invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present invention without departing from its scope. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed, but that the present invention will include all embodiments falling within the scope of the appended claims. 

What is claimed is:
 1. A method for resetting a gray code counter, the method comprising: in response to an indication that a data buffer controlled by the gray code counter has attained one of a plurality specified states, altering gradually, a write pointer associated with said data buffer until a reset value of said write pointer is reached; and in response to an indication that said data buffer controlled by the gray code counter has attained one of said plurality of specified states, altering gradually, a read pointer associated with said data buffer until a reset value of said read pointer is reached.
 2. The method according to claim 1, wherein said data buffer is a first-in-first-out (FIFO) buffer.
 3. The method according to claim 2, wherein said first-in-first-out (FIFO) buffer is an asynchronous first-in-first-out buffer.
 4. The method according to claim 1, wherein said data buffer is adapted to buffer at least one of voice data and video data.
 5. The method according to claim 1, wherein said plurality of specified states comprises full, empty, and a predefined level.
 6. The method according to claim 1, wherein said altering gradually said write pointer and said read pointer further comprises one of decrementing and incrementing one of said write pointer and said read pointer.
 7. A method for resetting a gray code counter, the method comprising: in response to an indication that a data buffer controlled by the gray code counter has attained one of a plurality specified states, disabling any attempt to write to said data buffer until a reset value of a write pointer controlling said data buffer is reached; and in response to an indication that said data buffer controlled by the gray code counter has attained said one of said plurality of specified states, disabling any attempt to read from said data buffer until a reset value of a read pointer controlling said data buffer is reached.
 8. The method according to claim 7, wherein said data buffer is a first-in-first-out (FIFO) buffer.
 9. The method according to claim 8, wherein said first-in-first-out (FIFO) buffer is an asynchronous first-in-first-out buffer.
 10. The method according to claim 7, wherein said data buffer is adapted to buffer at least one of voice data and video data.
 11. The method according to claim 7, wherein said disabling any attempt to write to said data buffer further comprises disabling generation of at least one flag until said reset value of said write pointer controlling said data buffer is reached.
 12. The method according to claim 7, wherein said disabling any attempt to read from said data buffer further comprises disabling generation of at least one flag until said reset value of said read pointer controlling said data buffer is reached.
 13. The method according to claim 7, wherein said plurality of specified states comprises full, empty, and a predefined level.
 14. A system for resetting a gray code counter, the system comprising: a decrementer for gradually decrementing one of a read pointer and a write pointer associated with said data buffer until a reset value of one of said read pointer and said write pointer is reached in response to an indication that a data buffer controlled by the gray code counter has attained one of a plurality specified states; and an incrementer for gradually incrementing one of a read pointer and a write pointer associated with said data buffer until a reset value of said one of said read pointer and said write pointer is reached in response to an indication that said data buffer controlled by the gray code counter is has attained one of said plurality of specified states.
 15. The system according to claim 14, wherein said data buffer is a first-in-first-out (FIFO) buffer.
 16. The system according to claim 15, wherein said first-in-first-out (FIFO) buffer is an asynchronous first-in-first-out buffer.
 17. The system according to claim 16, wherein said data buffer is adapted to buffer at least one of voice data and video data.
 18. The system according to claim 14, further comprising a flag generator for comparing an output of a write gray code counter associated with said write pointer and an output of a read gray code counter associated with said read pointer.
 19. The method according to claim 14, wherein said plurality of specified comprises full, empty, and a predefined level.
 20. A machine-readable storage, having stored thereon a computer program having a at least one code section for resetting a gray code counter, the at least one code section executable by a machine for causing the machine to perform the steps comprising: gradually altering a write pointer associated with a data buffer until a reset value of said write pointer is reached in response to an indication that said data buffer controlled by the gray code counter has attained one of a plurality specified states; and gradually altering a read pointer associated with said data buffer until a reset value of said read pointer is reached in response to an indication that said data buffer controlled by the gray code counter has attained one of said plurality of specified states.
 21. The machine-readable storage according to claim 20, wherein said at least one code section controls a first-in-first-out (FIFO) buffer.
 22. The machine-readable storage according to claim 21, wherein said at least one code section controls an asynchronous first-in-first-out buffer.
 23. The machine-readable storage according to claim 20, wherein said at least one code section controls a buffering of at least one of voice data and video data in said data buffer.
 24. The machine-readable storage according to claim 20, wherein said plurality of specified states comprises full, empty, and a predefined level.
 25. The machine-readable storage according to claim 20, wherein said at least one code section for altering gradually said write pointer and said read pointer further comprises code for decrementing and incrementing one of said write pointer and said read pointer. 